Correction to: GALP: a hybrid artificial intelligence algorithm for generating covering array
نویسندگان
چکیده
منابع مشابه
Generating artificial errors for grammatical error correction
This paper explores the generation of artificial errors for correcting grammatical mistakes made by learners of English as a second language. Artificial errors are injected into a set of error-free sentences in a probabilistic manner using statistics from a corpus. Unlike previous approaches, we use linguistic information to derive error generation probabilities and build corpora to correct sev...
متن کاملHYBRID ARTIFICIAL NEURAL NETWORKS BASED ON ACO-RPROP FOR GENERATING MULTIPLE SPECTRUM-COMPATIBLE ARTIFICIAL EARTHQUAKE RECORDS FOR SPECIFIED SITE GEOLOGY
The main objective of this paper is to use ant optimized neural networks to generate artificial earthquake records. In this regard, training accelerograms selected according to the site geology of recorder station and Wavelet Packet Transform (WPT) used to decompose these records. Then Artificial Neural Networks (ANN) optimized with Ant Colony Optimization and resilient Backpropagation algorith...
متن کاملCorrection to "A decoding algorithm with restrictions for array codes"
We present a simple and efficient error correction scheme for array-like data structures. We assume that the channel behaves such that each row of a received array is either error-free or corrupted by many symbol errors. Provided that row error vectors are linearly independent, the proposed decoding algorithm can correct asymptotically one erroneous row per redundant row, even without having re...
متن کاملA Hybrid Algorithm Forset Covering Problem 1
In this paper we propose a hybrid algorithm for the set covering problem (SCP), which combines L-class enumeration, genetic algorithm (GA) and Lagrangean heuristic. The lexicographical enumeration of L-classes in the linear relaxation of SCP ensures optimality of the resulting solution. Both heuristics are used for obtaining the initial approximate solution. The linear subproblems in L-class en...
متن کاملA cross entropy algorithm for continuous covering location problem
Covering problem tries to locate the least number of facilities and each demand has at least one facility located within a specific distance.This paper considers a cross entropy algorithm for solving the mixed integer nonlinear programming (MINLP) for covering location model.The model is solved to determine the best covering value.Also, this paper proposes aCross Entropy (CE) algorithm consider...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Soft Computing
سال: 2021
ISSN: 1432-7643,1433-7479
DOI: 10.1007/s00500-021-05848-5